Robust Optimization in Uncertain Capacitated Arc Routing Problems: Progresses and Perspectives [Review Article]

The capacitated arc routing problem is an important NP-hard with numerous real-world applications. uncertainties refers to those instances where there are in decision variables, objective functions and/or constraints. captures situations much better than a static because few problems and certain. Uncertainties the pose new research challenges. Algorithms that work well for certain may not on version uncer-tainties. There have been increasing progresses studying during past two decades. However, papers rout-ing scattered around different journals conferences artificial intelligence, computer science, operational research. Different defini-tions formulations of used by papers, making comparisons difficult. In order understand state-of-the-art solv-ing uncertainties, this paper presents comprehensive review its key issues. Not only has summarized so far, issues identified, including scalability algorithms, performance measures, common benchmarks, etc. Future direc-tions also identified at end review.